Primal Dual Methods for Wasserstein Gradient Flows

نویسندگان

چکیده

Abstract Combining the classical theory of optimal transport with modern operator splitting techniques, we develop a new numerical method for nonlinear, nonlocal partial differential equations, arising in models porous media, materials science, and biological swarming. Our proceeds as follows: first, discretize time, either via JKO scheme or novel Crank–Nicolson-type introduce. Next, use Benamou–Brenier dynamical characterization Wasserstein distance to reduce computing solution discrete time equations solving fully minimization problems, strictly convex objective functions linear constraints. Third, compute minimizers by applying recently introduced, provably convergent primal dual three operators (Yan J Sci Comput 1–20, 2018). By leveraging PDEs’ underlying variational structure, our overcomes stability issues present previous work built on explicit discretizations, which suffer due equations’ strong nonlinearities degeneracies. is also naturally positivity mass preserving and, case scheme, energy decreasing. We prove that problem converge spatially continuous, spatial discretization refined. conclude simulations nonlinear PDEs geodesics one two dimensions illustrate key properties approach, including higher-order convergence method, when compared method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive Primal-dual Hybrid Gradient Methods for Saddle-point Problems

The Primal-Dual hybrid gradient (PDHG) method is a powerful optimization scheme that breaks complex problems into simple sub-steps. Unfortunately, PDHG methods require the user to choose stepsize parameters, and the speed of convergence is highly sensitive to this choice. We introduce new adaptive PDHG schemes that automatically tune the stepsize parameters for fast convergence without user inp...

متن کامل

A Primal-Dual Approach for a Total Variation Wasserstein Flow

We consider a nonlinear fourth-order diffusion equation that arises in denoising of image densities. We propose an implicit timestepping scheme that employs a primal-dual method for computing the subgradient of the total variation semi-norm. The constraint on the dual variable is relaxed by adding a penalty term, depending on a parameter that determines the weight of the penalisation. The paper...

متن کامل

Balanced network flows. VII. Primal-dual algorithms

We discuss an adaptation of the famous primal-dual 1matching algorithm to balanced network flows which can be viewed as a network flow description of capacitated matching problems. This method is endowed with a sophisticated start-up procedure which eventually makes the algorithm strongly polynomial. We apply the primal-dual algorithm to the shortest valid path problem with arbitrary arc length...

متن کامل

Primal-dual interior-point methods

3. page 13, lines 12–13: Insert a phrase to stress that we consider only monotone LCP in this book, though the qualifier ”monotone” is often omitted. Replace the sentence preceding the formula (1.21) by The monotone LCP—the qualifier ”monotone” is implicit throughout this book—is the problem of finding vectors x and s in I R that satisfy the following conditions: 4. page 13, line −12: delete “o...

متن کامل

Primal-dual subgradient methods for convex problems

In this paper we present a new approach for constructing subgradient schemes for different types of nonsmooth problems with convex structure. Our methods are primaldual since they are always able to generate a feasible approximation to the optimum of an appropriately formulated dual problem. Besides other advantages, this useful feature provides the methods with a reliable stopping criterion. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Foundations of Computational Mathematics

سال: 2021

ISSN: ['1615-3383', '1615-3375']

DOI: https://doi.org/10.1007/s10208-021-09503-1